Join Size Estimation Subject to Filter Conditions

Heap-Filter Merge Join: A new algorithm for joining medium-size relations

We present a new algorithm for relational equi-join. The algorithm is a modification of merge join but promises superior performance for medium-size relations. In many cases, it even compares favorably with hybrid hash join.

Heap-Filter Merge Join: A New Algorithm For Joining Medium-Size Inputs

Similarity Join Size Estimation using Locality Sensitive Hashing

Similarity joins are important operations with a broad range of applications. In this paper, we study the problem of vector similarity join size estimation (VSJ). It is a generalization of the previously studied set similarity join size estimation (SSJ) problem and can handle more interesting cases such as TF-IDF vectors. One of the key challenges in similarity join size estimation is that the ...

Power-Law Based Estimation of Set Similarity Join Size

We propose a novel technique for estimating the size of set similarity join. The proposed technique relies on a succinct representation of sets using Min-Hash signatures. We exploit frequent patterns in the signatures for the Set Similarity Join (SSJoin) size estimation by counting their support. However, there are overlaps among the counts of signature patterns and we need to use the set Inclu...

Join Size Estimation on Boolean Tensors of RDF Data

The Resource Description Framework (rdf) represents information as subject–predicate–object triples. These triples are commonly interpreted as a directed labelled graph. We instead interpret the data as a 3-way Boolean tensor. Standard sparql queries then can be expressed using elementary Boolean algebra operations. We show how this representation helps to estimate the size of joins. Such estim...